A Fast Quad-Tree Based Two Dimensional Hierarchical Clustering
نویسندگان
چکیده
Recently, microarray technologies have become a robust technique in the area of genomics. An important step in the analysis of gene expression data is the identification of groups of genes disclosing analogous expression patterns. Cluster analysis partitions a given dataset into groups based on specified features. Euclidean distance is a widely used similarity measure for gene expression data that considers the amount of changes in gene expression. However, the huge number of genes and the intricacy of biological networks have highly increased the challenges of comprehending and interpreting the resulting group of data, increasing processing time. The proposed technique focuses on a QT based fast 2-dimensional hierarchical clustering algorithm to perform clustering. The construction of the closest pair data structure is an each level is an important time factor, which determines the processing time of clustering. The proposed model reduces the processing time and improves analysis of gene expression data.
منابع مشابه
High-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملFont Recognition Using Shape-Based Quad-tree and Kd-tree Decomposition
The search for appropriate data representations and visual features for content-based image retrieval continues within the computer vision community, alongside the development of new matching and indexing techniques to facilitate fast search in large-scale image databases. In this study, we present a solution to the problem of typeface identification and character recognition in text-based imag...
متن کاملTwo tree - formation methods and fast pattern search using nearestneighbor and nearest
4 This paper describes tree-based classiication of character images, comparing two methods of tree formation and two methods of matching: nearest neighbor and nearest centroid. The rst method, Preprocess Using Relative Distances (PURD) is a tree-based reorganization of a at list of patterns, designed to speed up nearest-neighbor matching. The second method is a variant of agglomerative hierarch...
متن کاملروش نوین خوشهبندی ترکیبی با استفاده از سیستم ایمنی مصنوعی و سلسله مراتبی
Artificial immune system (AIS) is one of the most meta-heuristic algorithms to solve complex problems. With a large number of data, creating a rapid decision and stable results are the most challenging tasks due to the rapid variation in real world. Clustering technique is a possible solution for overcoming these problems. The goal of clustering analysis is to group similar objects. AIS algor...
متن کاملFast and Improved Feature subset selection Algorithm Based Clustering for High Dimensional Data
The Clustering is a method of grouping the information into modules or clusters. Their dimensionality increases usually with a tiny number of dimensions that are significant to definite clusters, but data in the unrelated dimensions may produce much noise and wrap the actual clusters to be exposed. Attribute subset selection method is frequently used for data reduction through removing unrelate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 6 شماره
صفحات -
تاریخ انتشار 2012